New code upper bounds for the folded n-cube
نویسندگان
چکیده
منابع مشابه
New upper bounds of n!
We also proved that the approximation formula √ 2πn(n/e)neM [m] n for big factorials has a speed of convergence equal to n for m = 1,2,3,..., which give us a superiority over other known formulas by a suitable choice of m. Mathematics Subject Classification (2000): 41A60; 41A25; 57Q55; 33B15; 26D07.
متن کاملUpper bounds on the solutions to n = p+m^2
ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کاملLower bounds for the simplexity of the n-cube
In this paper we prove a new asymptotic lower bound for theminimal number of simplices in simplicial dissections of n-dimensional cubes. In particular we show that the number of simplices in dissections of n-cubes without additional vertices is at least (n + 1) n−1 2 . © 2012 Elsevier B.V. All rights reserved.
متن کاملupper bounds on the solutions to n = p+m^2
ardy and littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. they believed that the number $mathcal{r}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{r}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کاملNew Upper Bounds for Maximum -
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the use of Fischer's inequality with previously developed bounds. We demonstrate this in detail by using the partitioning idea to strengthen the spectral bounds of Ko, Lee and Queyranne and of Lee. Computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2020
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2019.105182